Robot cluster scheduling system

ABSTRACT

A robot cluster scheduling system includes a user layer, an intermediate layer, an application layer, a plug-in layer and a data persistence layer. The intermediate layer includes a processor mapping module and a state acquisition module. The application layer includes a task scheduling module and a traffic scheduling module. The plug-in layer includes a task solving engine and a traffic planning engine. The task solving engine is configured to determine a target robot according to a parameter of a task and state data. The traffic planning engine is configured to determine a target route. The task solving engine and the traffic planning engine each provide an application programming interface (API).

This application claims priority to Chinese patent application No.201810989933.6 entitled “ROBOT CLUSTER SCHEDULING SYSTEM” filed on Aug.28, 2018, disclosure of which is incorporated herein by reference in itsentirety.

TECHNICAL FIELD

The present disclosure relates to robotics, for example, a robot clusterscheduling system.

BACKGROUND

With the development of communication technology and electronictechnology, robots are increasingly used in the industrial field. In theapplication of robots, how to schedule robots is very important.

In the related art, a robot scheduling system includes a robot controlsystem and an intermediate control system. The robot control system isconfigured to acquire robot management information from the intermediatecontrol system, to generate a task instruction according to the robotmanagement information, and to send the task instruction to a guidedvehicle or an external device associated with the task instruction. Theintermediate control system includes a first interface layer, anintermediate service processing layer and an access layer. The firstinterface layer includes a service interface configured to acquire atask package from the service management system. The intermediateservice processing layer is configured to generate robot managementinformation according to the task package acquired from the servicemanagement system. The access layer includes a control interface and isconnected to the robot control system through the control interface.

However, in an aspect, the preceding robot scheduling system does notsupport a secondary development, and in another aspect, when sending atask instruction to the guided vehicle or the external device associatedwith the task instruction, the robot control system neither allocates atask according to parameters of the task instruction in an optimalmanner nor allocates an optimal route to the robot, resulting in arelatively low efficiency of execution of the task after scheduling.

SUMMARY

The present disclosure provides a robot cluster scheduling system. Thesystem can solve the problem of a relatively low efficiency of executionof the task after robot scheduling by a robot scheduling system in therelated art.

One embodiment provides a robot cluster scheduling system. The systemincludes a user layer including a service object of the schedulingsystem, where the service object is a user or a robot; an intermediatelayer including a processor mapping module and a state acquisitionmodule; an application layer including a task scheduling module and atraffic scheduling module; a plug-in layer including a task solvingengine and a traffic planning engine; and a data persistence layer.

The processor mapping module is configured to receive a task sent by theuser or a traffic planning request sent by the robot, and write the taskinto the data persistence layer or forward the traffic planning requestto the traffic scheduling module of the application layer after parsingthe task or the traffic planning request. The state acquisition moduleis configured to receive state data of the robots and write the statedata into the data persistence layer. The task scheduling module isconfigured to invoke the task solving engine after acquiring the taskfrom the data persistence layer, and the task solving engine isconfigured to determine a target robot according to a parameter of thetask and the state data and decompose the task into a subtask sequenceand send the subtask sequence to the target robot. The trafficscheduling module is configured to invoke the traffic planning engineafter receiving the traffic planning request from the processor mappingmodule, and the traffic planning engine is configured to determine atarget route according to a parameter in the traffic planning requestand the state data and send the target route to a robot that generatesthe traffic planning request. The task solving engine and the trafficplanning engine each provide an application programming interface (API).

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a structure diagram of a robot duster scheduling systemaccording to an embodiment.

FIG. 2A is a flowchart of implementation by the processor mapping moduleof the embodiment shown in FIG. 1.

FIG. 2B is a flowchart of implementation by the state acquisition moduleof the embodiment shown in FIG. 1.

FIG. 2C is a flowchart of implementation by the task scheduling moduleof the embodiment shown in FIG. 1,

FIG. 2D is a flowchart of implementation by the traffic schedulingmodule of the embodiment shown in FIG. 1.

FIG. 2E is a flowchart of implementation by the task solving engine ofthe embodiment shown in FIG. 1,

FIG. 2F is a flowchart of implementation by the traffic planning engineof the embodiment shown in FIG. 1.

FIG. 3 is a structure diagram of a robot cluster scheduling systemaccording to another embodiment.

FIG. 4 is a flowchart of implementation by the charging managementmodule of the embodiment shown in FIG. 3.

DETAILED DESCRIPTION

FIG. 1 is a structure diagram of a robot cluster scheduling systemaccording to this embodiment. As shown in FIG. 1, the robot clusterscheduling system includes a user layer, an intermediate layer, anapplication layer, a plug-in layer and a data persistence layer.

The user layer includes a service object of the scheduling system. Theservice object is a user or a robot. The intermediate layer includes aprocessor mapping module and a state acquisition module. The applicationlayer includes a task scheduling module and a traffic scheduling module.The plug-in layer includes a task solving engine and a traffic planningengine.

The processor mapping module is configured to receive a task sent by theuser or a traffic planning request sent by the robot, and write the taskinto the data persistence layer or forward the traffic planning requestto the traffic scheduling module of the application layer after parsingthe task or the traffic planning request.

The state acquisition module is configured to receive state data of therobots and write state data into the data persistence layer.

The task scheduling module is configured to invoke the task solvingengine after acquiring the task from the data persistence layer, and thetask solving engine is configured to determine a target robot accordingto a parameter of the task and the state data and decompose the taskinto a subtask sequence and send the subtask sequence to the targetrobot.

The traffic scheduling module is configured to invoke the trafficplanning engine after receiving the traffic planning request from theprocessor mapping module, and the traffic planning engine is configuredto determine a target route according to a parameter in the trafficplanning request and the state data and to send the target route to arobot that generates the traffic planning request.

The task solving engine and the traffic planning engine each provides anapplication programming interface (API).

In this embodiment, the system for scheduling the robot is a clusterscheduling system. The cluster scheduling system refers to a schedulingsystem using the cluster technology. A cluster is a group of computersindependent of each other and interconnected by a high-speed network.The computers in the cluster form a group and are managed in asingle-system mode. Cluster configuration can improve availability andscalability. Therefore, in this embodiment, the cluster technology isused to schedule the robot. This technology can improve the utilizationratio, stability and expandability of the scheduling system.

The cluster scheduling system of this embodiment can schedule multiplerobots.

In the user layer of this embodiment, the user can send a task to theprocessor mapping module of the intermediate layer. The task here maybe, for example, to have the robot go to a set position and fetch aparticular item. The task sent by the user may include a task parameter.The types of the task parameter vary with different tasks. For example,when the task is to have the robot go to a set position and fetch aparticular item, task parameters are the coordinates of the position andthe name of the item.

The robot in the user layer may send a traffic planning request to theprocessor mapping module of the intermediate layer. In one scenario,when a robot is to arrive at a set position but does not know which pathto follow to arrive fastest, the robot can send a traffic planningrequest to the processor mapping module. The traffic planning requestmay include the coordinates of the location to be reached and anidentifier of the robot.

FIG. 2A is a flowchart of implementation by the processor mapping moduleof the embodiment shown in FIG. 1. As shown in FIG. 2A, when executed,the processor mapping module of this embodiment performs the stepsdescribed below.

In step 210, a task or a traffic planning request is received.

In step 220, the task or the traffic planning request is parsed. If atask is received, step 230 is performed. If a traffic planning requestis received, step 240 is performed.

The purpose of the parsing is to identify whether the type of theacquired information is a task or a traffic planning request. Inaddition to the task parameter, the task may further include anidentifier indicating that the information is a task. In addition to thecoordinates of the location to be reached and the identifier of therobot, the traffic planning request may further include an identifierindicating that the information is a traffic planning request. Theprocessor mapping module may parse the task or the traffic planningrequest according to the identifier in the identification field todetermine the type of the information.

In step 230, the task is written into the data persistence layer, andthen step 250 is performed. If the processor mapping module determinesthat a task is acquired, the task is written into the data persistencelayer, and then the task waits to be acquired from the data persistencelayer by the task scheduling module of the application layer.

In step 240, the traffic planning request is forwarded to the trafficscheduling module, and then step 260 is performed.

In step 250, after the task is written into the data persistence layer,the information indicating that the task has been successfully writtenis fed back into the user in the user layer.

In step 260, the execution result returned by the traffic schedulingmodule is received and the execution result is fed back to the userlayer.

Setting step 250 and step 260 can improve the reliability ofcommunication between the processor mapping module and the user.

FIG. 2B is a flowchart of implementation by the state acquisition moduleof the embodiment shown in FIG. 1. As shown in FIG. 2B, when executed,the state acquisition module of this embodiment performs the stepsdescribed below.

In step 310, data monitoring is started.

After data monitoring is started, the state acquisition module can startreceiving the state data of the robot.

In step 320, the state data of the robot is received.

The state data here may include the identifier of the robot, theposition of the robot, the task being executed by the robot and the taskexecution state.

In step 330, the state data is parsed and written into the datapersistence layer.

After parsing the acquired state data, the state acquisition modulewrites the state data into the data persistence layer.

In an embodiment, after writing the state data to the data persistencelayer, the state acquisition module is further configured to perform thesteps described below.

In step 340, the control parameter of the robot is acquired from thedata persistence layer and sent to the robot.

The control parameter includes at least one of the followinginformation: the control mode of the robot or the maximum speed of therobot. The control mode of the robot refers to whether the robot is inmanual mode or in automatic mode.

FIG. 2C is a flowchart of implementation by the task scheduling moduleof the embodiment shown in FIG. 1. As shown in FIG. 2C, when executed,the task scheduling module of the application layer of this embodimentperforms the steps described below.

In step 410, hot backup data is restored.

After the cluster scheduling system crashes and restarts, step 410 needsto be performed so that historical state can be restored.

In step 420, a task is acquired from the data persistence layer.

In step 430, an engineering configuration file is loaded.

The data persistence layer further includes a description file thatincludes the engineering configuration file. The engineeringconfiguration file here includes information such as map information, arobot list, and the number of robots.

In step 440, it is determined whether a task is acquired. If no task isacquired, the process returns to step 420, If a task is acquired, step450 is performed.

In step 450, the task solving engine is invoked. The task solvingplug-in that is available in the current system is configured in theengineering configuration file.

In step 460, after the task solving engine is invoked, a target robot isdetermined according to the parameter of the task and the state data ofthe robot acquired by the state acquisition module. In this step,information such as map information, a robot list, and the number ofrobots in the engineering configuration file needs to be invoked toserve as additional parameters needed by task solving of the tasksolving engine.

In step 470, it is determined whether a target robot is acquired. If notarget robot is acquired, step 420 is performed. If it is determinedthat a target robot is acquired, step 480 is performed.

After the task solving engine is invoked, the task solving enginedetermines the target robot according to the parameter of the task andthe state data of the robot acquired by the state acquisition module.The target robot of this embodiment refers to the best and most suitablerobot for performing a task. The best and most suitable robot forperforming a task refers to a robot that satisfies the condition ofbeing closest to the target point or not performing a task at present.

In step 480, a subtask sequence is generated.

After it is determined that the target robot is acquired, the taskscheduling module may acquire, by invoking the task solving engine, thesubtask sequence generated according to the task. If it is determinedthat no target robot is acquired, no robot is suitable for executing thetask. In this case, the process returns to step 420.

The task may consist of a series of subtasks. For a robot, subtasks areexecutable.

In an embodiment, the task execution information and the execution stateof the task are also recorded in the data persistence layer. The taskscheduling module is further configured to perform step 480 after thetask is decomposed into a subtask sequence.

In step 490, the execution state of the task is changed from “notexecuted” to “being executed”.

In step 4100, the subtask sequence is sent to the target robot.

The task scheduling module is further configured to perform step 4100and step 4110 after the subtask sequence is sent to the target robot.

In step 4110, task execution information is acquired from the targetrobot.

The target robot may feed back the task execution information to thetask scheduling module during execution of the task. The task executioninformation is configured to indicate which subtask in the subtasksequence the task is executed. For example, if one task is decomposedinto a sequence composed of three subtasks, the task executioninformation may be as follows: the second subtask starts to be executed,the execution of the second subtask is completed, or the execution ofthe third subtask is completed.

In step 4120, the task execution information is written into the datapersistence layer.

The step of writing the task execution information to the datapersistence layer makes it easy for a user to query the execution stateof the task and control the execution progress of the task later andthereby improves the user experience.

In step 4130, it is determined whether the task is finished. If the taskis not finished, step 4100 is performed. If the task is finished, step4140 is performed.

The task scheduling module determines from the task executioninformation whether the task is finished. When the task executioninformation indicates that the execution of the last one subtask iscompleted, it is determined that the task is finished.

In step 4140, the task scheduling module is reset and the informationwritten into the data persistence layer is cleared.

When it is determined that the task is finished, step 4140 of resettingthe task scheduling module and clearing the information that is written,during execution of the task, into the data persistence layer isperformed to facilitate execution of the next task and save storagespace. When it is determined that the task is not finished, the processreturns to step 4100,

FIG. 2D is a flowchart of implementation by the traffic schedulingmodule of the embodiment shown in FIG. 1. As shown in FIG. 2C, whenexecuted, the traffic scheduling module of the application layer of thisembodiment performs the steps described below.

In step 510, an engineering configuration file is loaded.

The implementation process of this step is the same as that of step 430and thus is not repeated here.

In step 520, information in the traffic scheduling module is updated andthe information is transferred to the data persistence layer. Mapinformation is loaded from the engineering configuration file.

In step 530, a traffic planning request is received. The trafficscheduling module receives the traffic planning request from theprocessor mapping module.

In step 540, the traffic planning engine is invoked. When the trafficplanning engine is invoked, itis needed to load map information from theengineering configuration file.

After the traffic scheduling module invokes the traffic planning engine,the traffic planning engine can determine a target route according tothe state data and the parameter in the traffic planning request.

In step 550, the target route is sent to a robot that generates thetraffic planning request.

FIG. 2E is a flowchart of implementation by the task solving engine ofthe embodiment shown in FIG. 1. As shown in FIG. 2E, after informationacquisition, the task solving engine acquires a target robot (that is,determines a target robot according to parameter of the task and thestate data) and decomposes the task into a subtask sequence.

The task solving engine generates a subtask sequence for the task in thetwo implementations described below.

In the first implementation, the task solving engine includes multipletask types and subtask sequence templates corresponding to the tasktypes. Based on this implementation, the task solving engine decomposesthe task into a subtask sequence and sends the subtask sequence to thetarget robot. In an embodiment, the task solving engine determines asubtask sequence template corresponding to the task according to thetype of the task, substitutes the parameter of the task into the subtasksequence template corresponding to the task, obtains a subtask sequencecorresponding to the task, and sends the subtask sequence to the targetrobot.

For example, the subtask sequence template for the task of fetching anitem is: 1. to navigate to a set position and 2. to fetch the item. Therequired task parameter information includes the coordinates of theposition and the name of the item. For example, the processor mappingmodule acquires the following type of task: to go to point A and fetch acup, where the parameters of the task include the coordinates of point Aand the cup. After acquiring the task, the task scheduling moduleinvokes the task solving engine. The task solving engine determines thesubtask sequence template according to the type of the task and fills inthe subtask sequence template with the parameters of the task to obtainthe task subsequence: 1. to navigate to point A (coordinates) and 2. tofetch a cup.

In the second implementation, the task solving engine includes anintelligent solution algorithm. The task solving engine decomposes thetask into a subtask sequence and sends the subtask sequence to thetarget robot. In an embodiment, the task solving engine determines thesubtask sequence according to the intelligent solution algorithm and theparameter of the task and sends the subtask sequence to the targetrobot.

The intelligent solution algorithm can obtain ask steps according tocontent of the task and environment information of the current robot,and thereby acquire the subtask sequence.

For example, the processor mapping module receives a task of fetching acup. The task scheduling module invokes the task solving engine. Thetask parameter information is to fetch a cup. The task solving engineobtains the task steps: 1. to reach the position of the cup, 2. to takethe cup and 3. to return to the starting point. In an embodiment, thetask solving engine obtains environmental information including theposition of the cup and the position of the robot. Finally, the subtasksequence generated by the task solving engine is: 1. to navigate to theposition of the cup, 2. to take the cup and 3. to navigate to thestarting point.

FIG. 2F is a flowchart of implementation by the traffic planning engineof the embodiment shown in FIG. 1. As shown in FIG. 2F, the trafficplanning engine analyzes the road condition and determines the targetroute according to the parameter in the traffic planning request. Thetarget route of this embodiment may be a road name sequence consistingof road names or a route consisting of multiple coordinates.

In this embodiment, the task solving engine and the traffic planningengine each provide an API, The task solving engine and the trafficplanning engine can be redeveloped through the API. That is, the robotcluster scheduling system provided in this embodiment is open.

In this embodiment, the intermediate layer, the application layer andthe data persistence layer can all be implemented using the virtualcontainer technology of the application container engine (Docker).Docker is an application container engine that provides a containersolution.

Based on the Docker container technology, this embodiment has thefollowing advantages: 1. with the Docker container technology, the robotcluster scheduling system of this embodiment is easy to deploy; 2. withthe Docker container technology, the resource utilization rate and thedisaster tolerance of the system are improved; 3. with the Dockercontainer technology, the robot cluster scheduling system of thisembodiment has the automatic fault recovery capability; 4, with theDocker container technology, the robot cluster scheduling system of thisembodiment has the rolling upgrade function.

The robot cluster scheduling system provided in this embodiment supportsscheduling of robots having different structures.

The robot cluster scheduling system provided in this embodiment includesa user layer, an intermediate layer, an application layer, a plug-inlayer and a data persistence layer. The user layer includes a serviceobject of the scheduling system, where the service object is a user or arobot. The intermediate layer includes a processor mapping module and astate acquisition module. The application layer includes a taskscheduling module and a traffic scheduling module. The plug-in layerincludes a task solving engine and a traffic planning engine. Theprocessor mapping module is configured to receive a task sent by theuser or a traffic planning request sent by the robot, and write the taskinto the data persistence layer or forward the traffic planning requestto the traffic scheduling module of the application layer after parsingthe task or the traffic planning request. The state acquisition moduleis configured to receive state data of the robot and write the statedata into the data persistence layer. The task scheduling module isconfigured to invoke the task solving engine after acquiring the taskfrom the data persistence layer, and the task solving engine isconfigured to determine a target robot according to the parameter of thetask and the state data and decompose the task into a subtask sequenceand send the subtask sequence to the target robot. The trafficscheduling module is configured to invoke the traffic planning engineafter receiving the traffic planning request from the processor mappingmodule, and the traffic planning engine is configured to determine atarget route according to a parameter in the traffic planning requestand the state data and to send the target route to a robot thatgenerates the traffic planning request. The task solving engine and thetraffic planning engine each provides an API. In this way, the followingaspects are achieved: in one aspect, task solving and traffic planningare performed according to actual needs and the system has a lowcoupling degree; in another aspect, the target robot is determinedaccording to a task so that robot tasks are optimally allocated and thetask execution efficiency is improved after scheduling; in yet anotheraspect, the traffic route of a robot is intelligently planned so thattraffic jams are prevented.

FIG. 3 is a structure diagram of a robot duster scheduling systemaccording to another embodiment. Based on the embodiment shown in FIG.1, other modules of the robot cluster scheduling system are described indetail in this embodiment. In this embodiment, the state data acquiredby the state acquisition module includes electric quantity data ofmultiple robots. As shown in FIG. 3, the application layer furtherincludes a charging management module.

The charging management module is configured to determine, according tothe electric quantity data of robots, whether the robots need to becharged, determine, in response to determining that there is a robot tobe charged, the to-be-charged robot and determine whether a chargingresource is available, and to generate a charging task when determiningthat the charging resource is available, write the identifier of theto-be-charged robot into the data persistence layer and send thecharging task to the processor mapping module.

The charging task includes the identifier of the to-be-charged robot.

The processor mapping module is further configured to parse the chargingtask after receiving the charging task sent by the charging managementmodule and to write the charging task into the data persistence layer.The task scheduling module is further configured to invoke the tasksolving engine after acquiring the charging task from the datapersistence layer, and the task solving engine is configured todecompose the charging task into a charging subtask sequence and to sendthe charging subtask sequence to the robot corresponding to theidentifier.

FIG. 4 is a flowchart of implementation by the charging managementmodule of the embodiment shown in FIG. 3. As shown in FIG. 4, whenexecuted, the charging management module of the application layer ofthis embodiment performs the steps described below.

In step 610, an engineering configuration file is acquired. The chargingmanagement module acquires the engineering configuration file from thedata persistence layer.

In step 620, the engineering configuration file is loaded, and the stateacquisition module acquires a robot list from the engineeringconfiguration file.

In step 630, the electric quantity of a robot is checked.

The charging management module checks the electric quantity of therobots according to the state data. In an embodiment, the chargingmanagement module determines which one of the electric quantity and theminimum electric quantity threshold of the robot is greater according tothe state data.

In step 640, it is determined whether the robot needs to be charged. Ifit is determined that the robot does not need to be charged, the processreturns to step 630. If it is determined that the robot needs to becharged, step 650 is performed.

When it is determined that the electric quantity of the robot is lessthan the minimum electric quantity threshold, it is determined that therobot needs to be charged. Optionally, it is also possible to determinea to-be-charged robot, that is, to determine the identifier of theto-be-charged robot.

In step 650, it is determined whether a charging resource is available,and the state acquisition module loads charging resource informationfrom the engineering configuration file. If no charging resource isavailable, the process returns to step 630. If it is determined that acharging resource is available, step 660 is performed.

When it is determined that the robot needs to be charged, it isdetermined, according to information about the surrounding environment,whether a charging dock is available and whether the charging distanceis less than a preset threshold. When it is determined that a chargingdock is available and the charging distance is less than the presetthreshold, it is determined that the charging resource is available.

When it is determined that the robot does not need to be charged, theprocess returns to step 630.

In step 660, a charging task is generated.

The charging task is generated when it is determined that a chargingresource is available, Optionally, the charging task includes theidentifier of the to-be-charged robot.

When it is determined that no charging resource is available, theprocess returns to step 630.

In step 670, it is determined whether the charging task is generatedsuccessfully. If it is determined that the charging task fails to begenerated, step 630 is performed. If it is determined that the chargingtask is generated, step 680 is performed.

In step 680, the identifier of the to-be-charged robot is written intothe data persistence layer.

In step 690, the charging task is sent to the processor mapping module.

In step 6100, the execution state of the charging task is checked.

In step 6110, it is determined whether a charging task is completed. Ifno charging task is completed, step 6100 is performed. If a chargingtask is completed, step 6120 is performed.

In step 6120, the information written into the data persistence layer iscleared.

In an embodiment, the user may send an operation instruction. Theprocessor mapping module is further configured to receive the operationinstruction sent by the user and forward the instruction to the taskscheduling module, the traffic scheduling module or the chargingmanagement module after parsing the operation instruction. The taskscheduling module, the traffic scheduling module or the chargingmanagement module is further configured to operate according to theoperation instruction. The operation instruction includes at least oneof task state query, task deletion, task suspension or robot statequery.

Parsing the operation instruction means analyzing the type of the taskin the operation instruction: when the type is a task, the task isforwarded to the task scheduling module; when the type is a chargingtask, the charging task is forwarded to the charging management module;when the type is a traffic planning request, the traffic planningrequest is forwarded to the traffic scheduling module.

The step in which the task scheduling module, the traffic schedulingmodule or the charging management module operates according to theoperation instruction means that the three modules operate according tothe action indicated by the operation instruction: when the operationinstruction is a state query instruction, the current execution state isfed back; when the operation instruction is a deletion instruction, therelated task is deleted; when the operation instruction is a tasksuspension instruction, the currently executed task is suspended; whenthe operation instruction is a robot state query instruction, thecurrent robot state is fed back. The state of the robot may be a taskexecution state or an idle state.

For example, if the operation instruction is a charging task state queryinstruction, the processor mapping module parses the operationinstruction after receiving the operation instruction, determines thatthe operation instruction instructs to query the state of the chargingtask, and forwards the operation instruction to the charging managementmodule of the application layer, After receiving the operationinstruction, the charging management module feeds back the chargingstate of the robot (for example, the amount of charging) according tothe operation instruction.

With continued reference to FIG. 3, in this embodiment, the datapersistence layer includes a relational database and a memory-leveldatabase. A task and a charging task are stored in the relationaldatabase. Control parameters are stored in the memory-level database.The state data of the robot is stored in the memory-level database. Hotbackup data is stored in the memory-level database.

A relational database like My Structure Quest Language (MySQL) has theadvantage that the data structure is more complex and thus can bequeried according to complex conditions. A memory-level database likeRemote Dictionary Server (Redis) database has the advantages that thequery speed is fast and thus the database can be read and writtenfrequently.

In this embodiment, the data persistence layer further includes adescription file. The description file includes an engineeringconfiguration file.

In the robot cluster scheduling system provided in this embodiment, onthe one hand, the configuration in which the application layer includesa charging management module makes intelligent charging of a robotpossible when the electric quantity of the robot is less than thethreshold and thus improves the reliability of the robot; on the otherhand, an operation instruction sent by a user can be processed so thatthe flexibility of the scheduling system is improved.

From the description of embodiments, it will be apparent to thoseskilled in the art that the present disclosure may be implemented bymeans of software and necessary general-purpose hardware or may beimplemented by hardware. The computer software products may be stored ina computer-readable storage medium such as a computer floppy disk, aread-only memory (ROM), a random access memory (RAM), a flash memory, ahard disk, a CD or the like. The computer-readable storage medium isconfigured to include a plurality of instructions such that a computerdevice (which may be a personal computer, a server, a network device orthe like) performs the methods described in the preceding embodiments.

1. A robot cluster scheduling system, comprising: a user layer, whichcomprises a service object of the scheduling system, wherein the serviceobject is a user or a robot; an intermediate layer, which comprises aprocessor mapping module and a state acquisition module; an applicationlayer, which comprises a task scheduling module and a traffic schedulingmodule; a plug-in layer, which comprises a task solving engine and atraffic planning engine; and a data persistence layer; wherein theprocessor mapping module is configured to receive a task sent by theuser or a traffic planning request sent by the robot, and write the taskinto the data persistence layer or forward the traffic planning requestto the traffic scheduling module of the application layer after parsingthe task or the traffic planning request; the state acquisition moduleis configured to receive state data of the robots and write the statedata into the data persistence layer; and the task scheduling module isconfigured to invoke the task solving engine after acquiring the taskfrom the data persistence layer, and the task solving engine isconfigured to determine a target robot according to a parameter of thetask and the state data and decompose the task into a subtask sequenceand send the subtask sequence to the target robot; the trafficscheduling module is configured to invoke the traffic planning engineafter receiving the traffic planning request from the processor mappingmodule, and the traffic planning engine is configured to determine atarget route according to a parameter in the traffic planning requestand the state data and send the target route to a robot that generatesthe traffic planning request; the task solving engine and the trafficplanning engine each provide an application programming interface (API).2. The system of claim 1, wherein the state data comprises electricquantity data of the robots; the application layer further comprises acharging management module; the charging management module is configuredto determine, according to the electric quantity data of the robots,whether the robots need to be charged; determine, in response todetermining that there is a robot to be charged, the to-be-charged robotand determine whether a charging resource is available; and generate acharging task in response to determining that the charging resource isavailable and send the charging task to the processor mapping module,wherein the charging task comprises an identifier of the to-be-chargedrobot; the processor mapping module is further configured to parse thecharging task after receiving the charging task sent by the chargingmanagement module, and write the charging task into the data persistencelayer; and the task scheduling module is further configured to invokethe task solving engine after acquiring the charging task from the datapersistence layer, and the task solving engine is configured todecompose the charging task into a charging subtask sequence and sendthe charging subtask sequence to the robot corresponding to theidentifier.
 3. The system of claim 2, wherein the processor mappingmodule is further configured to receive an operation instruction sent bythe user, and forward, after parsing the operation instruction, theoperation instruction to the task scheduling module, the trafficscheduling module or the charging management module, wherein theoperation instruction comprises at least one of task state query, taskdeletion, task suspension or robot state query; and the task schedulingmodule, the traffic scheduling module or the charging management moduleis further configured to operate according to the operation instruction.4. The system of claim 1, wherein the task solving engine stores aplurality of task types and subtask sequence templates corresponding tothe plurality of task types; and the task solving engine is configuredto determine a subtask sequence template corresponding to the taskaccording to a type of the task, and substitute the parameter of thetask into the subtask sequence template corresponding to the task,obtain the subtask sequence corresponding to the task and send thesubtask sequence to the target robot.
 5. The system of claim 1, whereinthe task solving engine stores an intelligent solution algorithm; andthe task solving engine is configured to determine the subtask sequenceaccording to the intelligent solution algorithm and the parameter of thetask and to send the subtask sequence to the target robot.
 6. The systemof claim 2, wherein the data persistence layer is further configured tostore control parameters of the robots, and the state acquisition moduleis further configured to acquire the control parameters from the datapersistence layer after receiving the state data of the robots and sendthe control parameters to the robots, and wherein the control parameterscomprise at least one of the following information: control modes of therobots or maximum speeds of the robots.
 7. The system of claim 1,wherein the data persistence layer is further configured to record taskexecution information and an execution state of the task; the taskscheduling module is further configured to change the execution state ofthe task from “not executed” to “being executed” after the task isdecomposed into the subtask sequence; and the task scheduling module isfurther configured to acquire the task execution information from thetarget robot after invoking the task solving engine to cause the tasksolving engine to send the subtask sequence to the target robot, andwrite the task execution information into the data persistence layer,wherein the task execution information is configured to indicate whichsubtask in the subtask sequence the task is executed.
 8. The system ofclaim 6, wherein the data persistence layer stores a relational databaseand a memory-level database, wherein the relational database isconfigured to store the task and the charging task, and the memory-leveldatabase is configured to store the control parameters.
 9. The system ofclaim 8, wherein the data persistence layer further stores a descriptionfile, and wherein the description file comprises an engineeringconfiguration file; and the task scheduling module, the trafficscheduling module and the charging management module are each configuredto acquire the engineering configuration file from the description fileand to load the engineering configuration file.
 10. The system of claim1, wherein the intermediate layer, the application layer and the datapersistence layer are each implemented using a virtualized containertechnology of an application container engine Docker.
 11. The system ofclaim 2, wherein the task solving engine stores a plurality of tasktypes and subtask sequence templates corresponding to the plurality oftask types; and the task solving engine is configured to determine asubtask sequence template corresponding to the task according to a typeof the task, and substitute the parameter of the task into the subtasksequence template corresponding to the task, obtain the subtask sequencecorresponding to the task and send the subtask sequence to the targetrobot.
 12. The system of claim 3, wherein the task solving engine storesa plurality of task types and subtask sequence templates correspondingto the plurality of task types; and the task solving engine isconfigured to determine a subtask sequence template corresponding to thetask according to a type of the task, and substitute the parameter ofthe task into the subtask sequence template corresponding to the task,obtain the subtask sequence corresponding to the task and send thesubtask sequence to the target robot.
 13. The system of claim 2, whereinthe task solving engine stores an intelligent solution algorithm; andthe task solving engine is configured to determine the subtask sequenceaccording to the intelligent solution algorithm and the parameter of thetask and to send the subtask sequence to the target robot.
 14. Thesystem of claim 3, wherein the task solving engine stores an intelligentsolution algorithm; and the task solving engine is configured todetermine the subtask sequence according to the intelligent solutionalgorithm and the parameter of the task and to send the subtask sequenceto the target robot.
 15. The system of claim 2, wherein the datapersistence layer is further configured to record task executioninformation and an execution state of the task; the task schedulingmodule is further configured to change the execution state of the taskfrom “not executed” to “being executed” after the task is decomposedinto the subtask sequence; and the task scheduling module is furtherconfigured to acquire the task execution information from the targetrobot after invoking the task solving engine to cause the task solvingengine to send the subtask sequence to the target robot, and write thetask execution information into the data persistence layer, wherein thetask execution information is configured to indicate which subtask inthe subtask sequence the task is executed.
 16. The system of claim 3,wherein the data persistence layer is further configured to record taskexecution information and an execution state of the task; the taskscheduling module is further configured to change the execution state ofthe task from “not executed” to “being executed” after the task isdecomposed into the subtask sequence; and the task scheduling module isfurther configured to acquire the task execution information from thetarget robot after invoking the task solving engine to cause the tasksolving engine to send the subtask sequence to the target robot, andwrite the task execution information into the data persistence layer,wherein the task execution information is configured to indicate whichsubtask in the subtask sequence the task is executed.
 17. The system ofclaim 2, wherein the intermediate layer, the application layer and thedata persistence layer are each implemented using a virtualizedcontainer technology of an application container engine Docker.
 18. Thesystem of claim 3, wherein the intermediate layer, the application layerand the data persistence layer are each implemented using a virtualizedcontainer technology of an application container engine Docker.